Upper Bounds on Number of Steals in Rooted Trees
نویسندگان
چکیده
منابع مشابه
Upper Bounds on the Radio Number of Some Trees
Abstract: Let G be a simple,connected and undirected graph with diameter d. For a positive integer k (≤ d), a radio k-labeling f of G is an assignment of non-negative integers, called labels to the vertices of G such that if u, v ∈ V (G) are distinct then d(u, v) + |f(u) − f(v)| ≥ k + 1 where d(u, v) is the distance between u and v. The maximum label (positive integer) assigned by f to some ver...
متن کامل4-PLACEMENT OF ROOTED TREES
A tree T of order n is called k-placement if there are k edge-disjoint copies of T into K_{n}. In this paper we prove some results about 4-placement of rooted trees.
متن کاملHybridization Number on Three Rooted Binary Trees is EPT
Phylogenetic networks are leaf-labeled directed acyclic graphs that are used to describe nontreelike evolutionary histories and are thus a generalization of phylogenetic trees. The hybridization number of a phylogenetic network is the sum of all in-degrees minus the number of nodes plus one. The hybridization number problem takes as input a collection of rooted binary phylogenetic trees and ask...
متن کاملUpper Bounds on the Number of Spanning Trees in a Bipartite Graph
Ferrers graphs are a family of connected bipartite graphs that arise from the Ferrers diagram of a partition. Ehrenborg and van Willigenburg gave a beautiful product formula for the number of spanning trees in a Ferrers graph. In this paper, we use linear algebraic techniques to investigate a conjecture of Ehrenborg stating that a similar product formula gives an upper bound for the number of s...
متن کاملTwo Upper Bounds on the Chromatic Number
Processor cache memory management is a challenging issue as it deeply impact performances and power consumption of electronic devices. It has been shown that allocating data structures to memory for a given application (as MPEG encoding, filtering or any other signal processing application) can be modeled as a minimum k-weighted graph coloring problem, on the so-called conflict graph. The graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2015
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-015-9613-9